Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding
نویسندگان
چکیده
We present sparse interpolation algorithms for recovering a polynomial with $\le B$ terms from $N$ evaluations at distinct values the variable when E$ of can be erroneous. Our perform exact arithmetic in field scalars $\mathsf{K}$ and standard powers or Chebyshev polynomials, which case characteristic is $\ne 2$. return list valid interpolants support points run polynomial-time. For power basis our sample $N = \lfloor \frac{4}{3} E + 2 \rfloor points, are fewer than 2(E+1)B - 1$ given by Kaltofen Pernet 2014. \frac{3}{2} also number required algorithm Arnold 2015, has 74 \frac{E}{13} 1 \rfloor$ $B 3$ $E \ge 222$. method shows how to correct $2$ errors block $4B$ $1$ error $3B$ Basis.
منابع مشابه
Symbolic-Numeric Sparse Polynomial Interpolation in Chebyshev Basis and Trigonometric Interpolation
We consider the problem of efficiently interpolating an “approximate” black-box polynomial p(x) that is sparse when represented in the Chebyshev basis. Our computations will be in a traditional floating-point environment, and their numerical sensitivity will be investigated. We also consider the related problem of interpolating a sparse linear combination of “approximate” trigonometric function...
متن کاملSparse polynomial interpolation in Chebyshev bases
We study the problem of reconstructing a sparse polynomial in a basis of Chebyshev polynomials (Chebyshev basis in short) from given samples on a Chebyshev grid of [−1, 1]. A polynomial is called M -sparse in a Chebyshev basis, if it can be represented by a linear combination of M Chebyshev polynomials. For a polynomial with known and unknown Chebyshev sparsity, respectively, we present efficie...
متن کاملBlock-Based Sparse Integral Histogram with Interpolation
Integral Histogram is widely used among various real-time algorithms due to its computationally efficient facility to compute histograms from an image. However, its advantage is greatly diminished for algorithms requiring only a few histograms since required initialization operation takes up majority of total running time. In this paper we propose a block-based integral histogram that drastical...
متن کاملInterpolation on Sparse Gauss-Chebyshev Grids in Higher Dimensions
In this paper, we give a unified approach to error estimates for interpolation on sparse Gauß–Chebyshev grids for multivariate functions from Besov–type spaces with dominating mixed smoothness properties. The error bounds obtained for this method are almost optimal for the considered scale of function spaces. 1991 Mathematics Subject Classification: 41A05, 41A63, 65D05, 46E35
متن کاملComdined Turbo Block Decoding and Equalisation
In this paper, the combination of equalization and turbo decoding is studied. In the iterative decoding of a product code in block turbo coding system, the equalization process is performed within the iteration loop. The present study aims to investigate the decision feedback equalizer (DFE) incorporated in the iterative decoding. Simulation results show that the more severe the channel interfe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2020.3027036